Guarding simple polygons with semi-open edge guards
نویسندگان
چکیده
Let bd(P ) denote the boundary of a simple polygon P . Points p and q of P are mutually visible if segment pq lies entirely inside P . This notion of visibility gave birth to an extensive literature on art-gallery problems [3], concerned with guarding the floor of a polygonal art-gallery. Chvatal [2] showed that bn/3c point guards are always sufficient and sometimes necessary. Allowing guards to move on an edge gives rise to the class of edge guard problems. An edge guard is closed (open) if the end-points of the edge are included (excluded), semi-open if only one end-point is included. Shermer [5] established an upper bound of b3n/10c + 1 on the number of closed edge guards needed, while Toussaint [3] showed that bn/4c guards are sometimes necessary. A guard edge is one that guards all of P . In [6], Toth et al. have shown that a non star-shaped simple polygon has at most one open guard edge. Park et al. [4] showed that such a polygon can have at most 3 closed guard edges.
منابع مشابه
Hidden Mobile Guards in Simple Polygons
We consider guarding classes of simple polygons using mobile guards (polygon edges and diagonals) under the constraint that no two guards may see each other. In contrast to most other art gallery problems, existence is the primary question: does a specific type of polygon admit some guard set? Types include simple polygons and the subclasses of orthogonal, monotone, and starshaped polygons. Add...
متن کاملSome Results on Open-Edge and Open Mobile Guarding of Polygons and Triangulations
This paper focuses on a variation of the Art Gallery problem that considers open edge guards and open mobile guards. A mobile guard can be placed on edges and diagonals of a polygon, and the “open” prefix means that the endpoints of such edge or diagonal are not taken into account for visibility purposes. This paper studies the number of guards that are sufficient and sometimes necessary to gua...
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملConstant Approximation Algorithms for Guarding Simple Polygons using Vertex Guards
The art gallery problem enquires about the least number of guards sufficient to ensure that an art gallery, represented by a polygon P , is fully guarded. Most standard versions of this problem are known to be NP-hard. In 1987, Ghosh provided a deterministic O(log n)approximation algorithm for the case of vertex guards and edge guards in simple polygons. In the same paper, Ghosh also conjecture...
متن کاملOpen Guard Edges and Edge Guards in Simple Polygons
An open edge of a simple polygon is the set of points in the relative interior of an edge. We revisit several art gallery problems, previously considered for closed edge guards, using open edge guards. A guard edge of a polygon is an edge that sees every point inside the polygon. We show that every simple non-starshaped polygon admits at most one open guard edge, and give a simple new proof tha...
متن کامل